Everyone Knows That Someone Knows: Quantifiers over Epistemic Agents
نویسنده
چکیده
Modal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the firstorder modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging over the set of agents, and proves its soundness and completeness with respect to
منابع مشابه
Reasoning About Knowledge in Philosophy: The Paradigm of Epistemic Logic
Theories of knowledge representation and reasoning about knowledge in philosophy are considered from the vantage point of epistemic logic. This logic is primarily a logic of knowing that, and its semantics can be considered an explication of the well-known idea that "information means elimination of uncertainty". A number of other theories are discussed as further developments of epistemic logi...
متن کاملA first-order epistemic quantum computational semantics with relativistic-like epistemic effects
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics wellformed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the information in question. At the same time, the logical connectives are interpreted as quantum logical gates: unitary operators that process quantum i...
متن کاملKnowledge in lineland
In this paper we investigate a concrete epistemic situation: there are agents (humans, robots, cameras,...) and propositions (lamps on or off, obstacles dangerous or not,...) located in Lineland. We express properties with the standard epistemic logic language like “Agent A knows that agent B knows that lamp L is on”. We give some words about modelchecking, satisfiability problem and common kno...
متن کاملAgreement and Updating For Self-Locating Belief
Suppose we have two ideally rational, perfectly introspective, individuals, who want to pool their information. Since both individuals are perfectly introspective, they are both in a position to characterize to the other exactly what they know. Suppose, then, that each tells the other what they know and each correspondingly incorporates this information into what they know. Given that such indi...
متن کاملDRAFT Epistemic Closure in Context
1. Epistemic closure The general principle of epistemic closure stipulates that epistemic properties are transmissible through logical means. The principle of epistemic closure under known entailment (ECKE), a particular instance of epistemic closure (EC), has received a good deal of attention since the last thirty years or so. ECKE states that: if one knows that p, and she knows that p entails...
متن کامل